Expansive Invertible Onesided Cellular Automata
نویسنده
چکیده
We study expansive invertible onesided cellular automata (i.e., expansive automorphisms of onesided full shifts) and find severe dynamical and arithmetic constraints which provide partial answers to questions raised by M. Nasu [N2]. We employ the images and bilateral dimension groups, measure multipliers, and constructive combinatorial characterizations for two classes of cellular automata.
منابع مشابه
Combinatorial constructions associated to the dynamics of one-sided cellular automata
In this paper we study combinatorial constructions which lead to one-sided invertible cellular automata with di5erent dynamical behavior: equicontinuity, existence of equicontinuous points but not equicontinuity, sensitivity and expansivity. In particular, we provide a simple characterization of the class of equicontinuous invertible one-sided cellular automata and we construct families of expa...
متن کاملHow to Simulate Turing Machines by Invertible One-Dimensional Cellular Automata
The issue of testing invertibility of cellular automata has been often discussed. Constructing invertible automata is very useful for simulating invertible dynamical systems, based on local rules. The computation universality of cellular automata has long been positively resolved, and by showing that any cellular automaton could be simulated by an invertible one having a superior dimension, Tof...
متن کاملMeasure rigidity for algebraic bipermutative cellular automata
Let (AZ, F ) be a bipermutative algebraic cellular automaton. We present conditions which force a probability measure which is invariant for the N×Z-action of F and the shift map σ to be the Haar measure on Σ, a closed shift-invariant subgroup of the Abelian compact group AZ. This generalizes simultaneously results of B. Host, A. Maass and S. Mart́ınez [7] and M. Pivato [14]. This result is appl...
متن کاملPhase Space Invertible Asynchronous Cellular Automata
While for synchronous deterministic cellular automata there is an accepted definition of reversibility, the situation is less clear for asynchronous cellular automata. We first discuss a few possibilities and then investigate what we call phase space invertible asynchronous cellular automata in more detail. We will show that for each Turing machine there is such a cellular automaton simulating ...
متن کاملInvertible Cellular Automata: a Review
In the light of recent developments in the theory of invertible cellular automata, we attempt to give a uniied presentation of the subject and discuss its relevance to computer science and mathematical physics.
متن کامل